Permutation groups and the graph isomorphism problem
نویسندگان
چکیده
In this article, we discuss various algorithms for permutation group theoretic problems and study its close connection to the graph isomorphism problem. Motivated by this close connection, the last part of this article explores the group representability problem and mention some open problems that arise in this context.
منابع مشابه
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more general result: we show that a generic problem FIND-GROUP has an FPSPP algorithm. This general result has other consequences: for example, it follows that the hidden subgroup problem for permutation groups, studied in the c...
متن کاملPermutation Groups and Polynomial-Time Computation
Abstra t. We dis uss aspe ts of omputation in permutation groups assuming polynomial time as a measure of eÆ ien y. Of parti ular interest are problems, su h as nding the interse tion of two groups, that resemble or generalize the problem of testing graph isomorphism. We also summarize the instan es where the problems are known to be solvable in polynomial time and indi ate methods that a ompli...
متن کاملGraph Isomorphism
While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...
متن کاملAutomorphism Groups of Comparability Graphs
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension dim(X) of a comparability graph X is the dimension of any transitive orientation of X, and by k-DIM we denote the class of comparability graphs X with dim(X) ≤ k. It is known that the complements of comparability gra...
متن کاملRepresenting Groups on Graphs
In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism, even when the group is presented as a permutation group via generators. On the other hand, the representability problem for general groups on trees is equival...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015